Analisa Hasil Pengelompokan Wilayah Kejadian Non-Kebakaran Menggunakan Agglomerative Hierachical Clustering di Semarang

نویسندگان

چکیده

Abstrak−Klasterisasi merupakan metode pengelompokan dari data yang sudah diketahui label kelasnya untuk menemukan klaster baru hasil observasi. Dalam klasterisasi banyak yaitu terpusat, hirarki, kepadatan dan berbasis kisi, namun dalam penelitian dilakukan ini dipilih hirarki. Metode hirarki bekerja melakukan objek dengan membentuk bukan berarti selalu digambarkan organsasi. Dipilihnya Agglomerative Hierarchical Clustering dimana jenis bawah ke atas atau biasa disebut (bottom-up) akan diuji dianggap sebagai tunggal lalu iterasi klaster-klaster lebih besar. Data digunakan adalah non-kebakaran pada Dinas Pemadam Kebakaran Kota Semarang ynng mana wilayah penanganan non-kebakaran. hanya kebakaran saja ada hal sebenarnya dapat ditangani oleh petugas pemadam kebakaran, kejadian beberapa seperti evakuasi reptil, kucing, penyelamatan korban kecelakaan lain sebagainya. Dari 16 kecamatan di tahun 2019 uji menggunakan tiga algoritma Single Lingkage, Average Linkage Complete . Adapun prosedur pemusatan jarak terkecil antar data, rata-rata sedangkan jika terbesar. Implementasi visualiasi coba penilitian tools WEKA 3.8.4, Wakaito Environment Analysis for Knowledge dikenal software bahasa pemrograman java. dataset 380 diambil sampel 100 mengunakan perhtungan Manhattan Distance 3 cluster. Hasil divisualisasikan visualisasi dendogram fitur visualize tree bentuk grafik clusters assignment.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Agglomerative Info-Clustering

An agglomerative clustering of random variables is proposed, where clusters of random variables sharing the maximum amount of multivariate mutual information are merged successively to form larger clusters. Compared to the previous info-clustering algorithms, the agglomerative approach allows the computation to stop earlier when clusters of desired size and accuracy are obtained. An efficient a...

متن کامل

Agglomerative Bregman Clustering

This manuscript develops the theory of agglomerative clustering with Bregman divergences. Geometric smoothing techniques are developed to deal with degenerate clusters. To allow for cluster models based on exponential families with overcomplete representations, Bregman divergences are developed for nondifferentiable convex functions.

متن کامل

Fuzzy Agglomerative Clustering

In this paper, we describe fuzzy agglomerative clustering, a brand new fuzzy clustering algorithm. The basic idea of the proposed algorithm is based on the well-known hierarchical clustering methods. To achieve the soft or fuzzy output of the hierarchical clustering, we combine the single-linkage and completelinkage strategy together with a fuzzy distance. As the algorithm was created recently,...

متن کامل

An On-line Agglomerative Clustering Method for Non-Stationary Data

An on-line agglomerative clustering algorithm for nonstationary data is described. Three issues are addressed. The first regards the temporal aspects of the data. The clustering of stationary data by the proposed algorithm is comparable to the other popular algorithms tested (batch and on-line). The second issue addressed is the number of clusters required to represent the data. The algorithm p...

متن کامل

Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms

In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Tekno Kompak

سال: 2021

ISSN: ['1412-9663', '2656-3525']

DOI: https://doi.org/10.33365/jtk.v15i2.1166